A supertree method for rooted trees
نویسندگان
چکیده
The amalgamation of leaf-labelled (phylogenetic) trees on overlapping leaf sets into one (super)tree is a central problem in several areas of classification, particularly evolutionary biology. In this paper, we describe a new technique for amalgamating rooted phylogenetic trees. This appears to be the first such method to provably exhibit particular desirable properties which we list and establish.
منابع مشابه
Constructing rooted supertrees using distances.
Suppose that a family of rooted phylogenetic trees Ti with different sets Xi of leaves is given. A supertree for the family is a single rooted tree T whose leaf set is the union of all the Xi, such that the branching information in T corresponds to the branching information in all the trees Ti. This paper proposes a polynomial-time method BUILD-WITH-DISTANCES that makes essential use of distanc...
متن کاملAmalgamating source trees with different taxonomic levels.
Supertree methods combine a collection of source trees into a single parent tree or supertree. For almost all such methods, the terminal taxa across the source trees have to be non-nested for the output supertree to make sense. Motivated by Page, the first supertree method for combining rooted source trees where the taxa can be hierarchically nested is called AncestralBuild. In addition to taxa...
متن کاملA Supertree Method for Rooted Trees Charles Semple and Mike Steel
The amalgamation of leaf-labelled (phylogenetic) trees on overlapping leaf sets into one (super)tree is a central problem in several areas of classi cation, particularly evolutionary biology. In this paper, we describe a new technique for amalgamating rooted phylogenetic trees. This appears to be the rst such method to provably exhibit particular desirable properties which we list and establish.
متن کاملFinding a largest subset of rooted triples identifying a tree is an NP - hard task Research
Supertree methods are used to build comprehensive phylogenies from source trees with overlapping sets of leaves. Ranwez et al. (2007) recently proposed a polynomial-time method outputting supertrees that verify attractive mathematical properties to obtain a consensual summary of a collection of source trees. The topological information of the source trees that is considered by the method is the...
متن کاملExtending the Limits of Supertree Methods
Recently, two exact polynomial-time supertree methods have been developed in which the traditional input of rooted leaf-labelled trees has been extended in two separate ways. The first method, called RankedTree, allows for the inclusion of relative divergence dates and the second method, called AncestralBuild, allows for the inclusion of rooted trees in which some of the interior vertices as we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 105 شماره
صفحات -
تاریخ انتشار 2000